public class work {
    //力扣：35. 搜索插入位置
    public int searchInsert(int[] nums, int target) {
        int left=0;
        int right=nums.length-1;
        while(left<right){
            int mid=left+(right-left)/2;
            if(nums[mid]<target)left=mid+1;
            if(nums[mid]>target)right=mid;
            if(nums[mid]==target)return mid;
        }
        return nums[left]<target ? left+1:left;
    }
}
